/*
 * -- Recursion --
 * 
 * Recursion is an alorithmic technique in which a method may call itself.
 * 
 * x^n = x*x*x*...*xn
 * 
 * Factorial --
 * 1 if n=0
 * n(n-1)! if n>0
 * 
 * Fib(n):
 * 1 if n=0
 * 1 if n=1
 * Fib(n-1)+Fib(n-2) if n>0
 * 
 * Every correct recursive definition has two components:
 * 	One or more base cases where the answer can be found directly
 * 	One or more recursive cases where the answer depends on "smaller" (previous) 
 * 		instances of the same problem
 * 		
 * 
 */
public class Recursion {
	public int factorial(int num) {
		if(num==0)
			return 1;
		
	}
}
